Towards Hybrid Optimal Control
نویسندگان
چکیده
منابع مشابه
Towards Hybrid Optimal Control
In this article a general class of hybrid optimal control problems with continuous and discrete state variables and control inputs is defined. After a brief review of conventional optimal control, major novel challenges resulting from the hybrid nature are discussed. Some application problems are comparatively easy to solve because of the fixed or known sequence of discrete events; however, if ...
متن کاملConstrained Nonlinear Optimal Control via a Hybrid BA-SD
The non-convex behavior presented by nonlinear systems limits the application of classical optimization techniques to solve optimal control problems for these kinds of systems. This paper proposes a hybrid algorithm, namely BA-SD, by combining Bee algorithm (BA) with steepest descent (SD) method for numerically solving nonlinear optimal control (NOC) problems. The proposed algorithm includes th...
متن کاملPareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm
Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...
متن کاملAlgorithms for Hybrid Optimal Control
Abstract. We consider a non linear ordinary differential equation and want to control its behavior so that it reaches a target by minimizing a cost function. Our approach is to use hybrid systems to solve this problem: the complex dynamic is replaced by piecewise affine approximations which allow an analytical resolution. The sequence of affine models then forms a sequence of states of a hybrid...
متن کاملOptimal Control of Hybrid Systems
This paper presents a method for optimal control of hybrid systems. An inequality of Bellman type is considered and every solution to this inequality gives a lower bound on the optimal value function. A discretization of this “hybrid Bellman inequality” leads to a convex optimization problem in terms of finitedimensional linear programming. From the solution of the discretized problem, a value ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: auto
سال: 2000
ISSN: 2196-677X,0178-2312
DOI: 10.1524/auto.2000.48.9.448